Bi-connectivity, k-connectivity and Multipoint Relays

نویسندگان

  • Laurent Viennot
  • Philippe Jacquet
چکیده

Multipoint relays were introduced to optimize flooding in ad hoc networks. They are also used to determine a sub-topology containing shortest paths in the OLSR routing protocol. We show that a generalized version of multipoint relays can be used to construct a sub-topology preserving bi-connectivity and more generally k-connectivity. Moreover, we show that the multipoint relay structure is intrinsic to any sub-topology with similar properties. Key-words: ad hoc, bi-connectivity, k-connectivity, multipoint relays, OLSR ∗ INRIA Rocquencourt, Domaine de Voluceau, 78153 Le Chesnay † Travaux supportés par Sagem. Bi-connexité, k-connexité et multipoints relais Résumé : Les multipoints relais ont été introduits pour optimiser l’inondation dans un réseau ad hoc. Ils servent aussi, dans le protocole OLSR, à déterminer une sous-topologie qui conserve les plus courts chemins. Nous montrons, comment une généralisation des multipoints relais permet d’obtenir une sous-topologie conservant des propriétés de biconnexité et plus généralement de k-connexité. Nous montrons de plus, que cette structure de multipoints relais est intrinsèque à toute sous-topologie montrant les mêmes propriétés. Mots-clés : ad hoc, bi-connexité, k-connexité, multipoints relais, OLSR Bi-connectivity and MPRs 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eccentricity Sequence and the Eccentric Connectivity Index of Two Special Categories of Fullerenes

In this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in N) carbon atoms.

متن کامل

On the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups

Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...

متن کامل

Connectivity as a Measure of Power System Integrity

Measures of network structural integrity useful in the analysis and synthesis of power systems are discussed. Signal flow methodology is applied to derive an expression for the paths between sources and sinks in a power network. Connectivity and reach ability properties of the network are obtained using the minors of a modified connectivity matrix. Node-connectivity, branch connectivity and mix...

متن کامل

Fourth order and fourth sum connectivity indices of tetrathiafulvalene dendrimers

The m-order connectivity index (G) m of a graph G is     1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d  G where 1 2 1 ... i i im d d d  runs over all paths of length m in G and i d denotes the degree of vertex i v . Also,        1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i ms d d d X G is its m-sum connectivity index. A dendrimer is an artificially manufactured or synth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007